Blocking, Monotonicity, and Turing Completeness in a Database Language for Sequences and Streams

Query Languages and Data Models for Database Sequences and Data Streams

We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments to deal with them. We begin by observing the well-known limitations of SQL in application domains which are important for data streams, such as sequence queries and data mining. Then we present a formal proof that, for...

An Introduction to the Expressive Stream Language ( ESL ) 1 WEB

ESL is the application language of the Stream Mill system that supports2: • Continuous queries on data streams, • Ad hoc queries on (i) database tables and (ii) on concrete views created from streaming data, • Spanning applications that combine and compare incoming live data with stored data. ESL is based on SQL to help users to learn it, and use it on spanning applications. For the same reason...

ATLaS: a Turing-Complete Extension of SQL for Data Mining Applications and Streams

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

Turing-Completeness of Polymorphic Stream Equation Systems

Polymorphic stream functions operate on the structure of streams, infinite sequences of elements, without inspection of the contained data, having to work on all streams over all signatures uniformly. A natural, yet restrictive class of polymorphic stream functions comprises those definable by a system of equations using only stream constructors and destructors and recursive calls. Using method...